package com.gitee.ty850454;

public class Leetcode704 {


    static class Solution {
        public int search(int[] nums, int target) {

            int leftIndex = 0;
            int rightIndex = nums.length;
            int middleIndex = (leftIndex + rightIndex) / 2;




            return -1;
        }
    }


    public static void main(String[] args) {
        System.out.println(new Solution().search(new int[]{-1, 0, 3, 5, 9, 12}, 9));
    }


}
